Optimal Fractal Coding is NP - Hard 1 ( Extended
نویسندگان
چکیده
In fractal compression a signal is encoded by the parameters of a contractive transformation whose fixed point (attractor) is an approximation of the original data. Thus fractal coding can be viewed as the optimization problem of finding in a set of admissible contractive transformations the transformation whose attractor is closest to a given signal. The standard fractal coding scheme based on the Collage Theorem produces only a suboptimal solution. We demonstrate by a reduction from MAXCUT that the problem of determining the optimal fractal code is NP-hard. To our knowledge, this is the first analysis of the intrinsic complexity of fractal coding. Additionally, we show that standard fractal coding is not an approximating algorithm for this problem.
منابع مشابه
On the Inverse Problelll of Fractal COlllpression
The inverse problem of fractal compression amounts to determining a contractive operator such that the corresponding fixed point approximates a given target function. The standard method based on the collage coding strategy is known to represent a suboptimal method. Why does one not search for optimal fractal codes? We will prove that optimal fractal coding, when considered as a discrete optimi...
متن کاملFast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is an NP-hard combinatorial optimization problem. Conventional coding is based on a greedy suboptimal algorithm known as collage coding. In a previous study, we proposed a local search algorithm that significantly improve...
متن کاملThe Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract)
We consider computing optimal k-norm preemptive schedules of jobs that arrive over time. In particular, we show that computing the optimal k-norm of flow schedule, 1 | rj , pmtn | ∑ j(Cj − rj) k in standard 3-field scheduling notation, is strongly NP-hard for k ∈ (0, 1) and integers k ∈ (1,∞). Further we show that computing the optimal k-norm of stretch schedule, 1 | rj , pmtn | ∑ j((Cj − rj)/p...
متن کاملComplexity and Approximability of Problems Related to Integer Programming
Many problems of both practical and theoretical importance concern themselves not only with finding a solution but also finding a ‘best’ solution in some sense. As a concrete example, let us consider the travelling salesperson problem (TSP): a salesperson has to visit some specified towns on a tour starting and ending in her/his home town; in which order should the towns be visited in order to ...
متن کاملRobust dissipativity of interval uncertain systems
In this paper we are concerned with the problem of robust dissipativity of linear systems with parameters affected by box uncertainty; our major goal is to evaluate the largest uncertainty level for which all perturbed instances share a common dissipativity certificate. While it is NP-hard to compute this quantity exactly, we demonstrate that under favourable circumstances one can build an O(1)...
متن کامل